Finite set

Results: 238



#Item
41Finite dualities and map-critical graphs on a fixed surface Jaroslav Neˇsetˇril1∗ and Yared Nigussie2† 1 Department of Applied Mathematics

Finite dualities and map-critical graphs on a fixed surface Jaroslav Neˇsetˇril1∗ and Yared Nigussie2† 1 Department of Applied Mathematics

Add to Reading List

Source URL: iti.mff.cuni.cz

Language: English - Date: 2016-02-04 05:53:37
    42On Multiplicative λ-Approximations and Some Geometric Applications∗ Ilan Newman† Abstract Let F be a set system over an underlying finite set X, and let µ be a nonnegative P measure over X. I.e.,∗ for every

    On Multiplicative λ-Approximations and Some Geometric Applications∗ Ilan Newman† Abstract Let F be a set system over an underlying finite set X, and let µ be a nonnegative P measure over X. I.e.,∗ for every

    Add to Reading List

    Source URL: cs.haifa.ac.il

    Language: English - Date: 2011-10-04 15:03:44
      43Application 3.2 (Ruzsa). Let α ∈ R and A be a finite non-empty set in a commutative group. Suppose that |A + A| ≤ α|A|. Then for all positive integers h ≥ 2  4  α +h−2 2 |hA − A| ≤

      Application 3.2 (Ruzsa). Let α ∈ R and A be a finite non-empty set in a commutative group. Suppose that |A + A| ≤ α|A|. Then for all positive integers h ≥ 2  4  α +h−2 2 |hA − A| ≤

      Add to Reading List

      Source URL: www-ma2.upc.edu

      Language: English - Date: 2014-10-13 08:36:47
        44THE SET OF MINIMAL DISTANCES IN KRULL MONOIDS arXiv:submitmath.AC] 17 Jun 2015 ALFRED GEROLDINGER AND QINGHAI ZHONG Abstract. Let H be a Krull monoid with finite class group G. Then every non-unit a ∈ H can

        THE SET OF MINIMAL DISTANCES IN KRULL MONOIDS arXiv:submitmath.AC] 17 Jun 2015 ALFRED GEROLDINGER AND QINGHAI ZHONG Abstract. Let H be a Krull monoid with finite class group G. Then every non-unit a ∈ H can

        Add to Reading List

        Source URL: qinghai-zhong.weebly.com

        Language: English - Date: 2015-06-17 04:14:26
          45SQUARES IN SUMSETS HOI H. NGUYEN AND VAN H. VU Abstract. A finite set A of integers is square-sum-free if there is no subset of A sums up to a square. In 1986, Erd˝ os posed the problem of determining the

          SQUARES IN SUMSETS HOI H. NGUYEN AND VAN H. VU Abstract. A finite set A of integers is square-sum-free if there is no subset of A sums up to a square. In 1986, Erd˝ os posed the problem of determining the

          Add to Reading List

          Source URL: people.math.osu.edu

          Language: English - Date: 2010-05-24 09:06:03
            46Generalised Dualities and Finite Maximal Antichains∗ (extended abstract) Jan Foniok1 Jaroslav Neˇsetˇril1

            Generalised Dualities and Finite Maximal Antichains∗ (extended abstract) Jan Foniok1 Jaroslav Neˇsetˇril1

            Add to Reading List

            Source URL: iti.mff.cuni.cz

            Language: English - Date: 2016-02-04 05:53:37
              47A Simple Algorithm for Computing a Spiral Polygonization of a Finite Planar Set M. Ahsan, S. Cheruvatur, M. Gamboni, A. Garg, O. Grishin, S. Hashimoto, J. Jermsurawong, G. T. Toussaint, and L. Zhang Faculty of Science, N

              A Simple Algorithm for Computing a Spiral Polygonization of a Finite Planar Set M. Ahsan, S. Cheruvatur, M. Gamboni, A. Garg, O. Grishin, S. Hashimoto, J. Jermsurawong, G. T. Toussaint, and L. Zhang Faculty of Science, N

              Add to Reading List

              Source URL: fwcg14.cse.uconn.edu

              Language: English - Date: 2014-10-29 21:34:14
                48LECTURE NOTES ON MATROIDS MARTIN LOEBL Abstract. These are lecture notes for the first part of the lecture ”Introduction to Mathematical Programming”. 1. Basic concepts Definition 1.1. Let X be a finite set and S ⊂

                LECTURE NOTES ON MATROIDS MARTIN LOEBL Abstract. These are lecture notes for the first part of the lecture ”Introduction to Mathematical Programming”. 1. Basic concepts Definition 1.1. Let X be a finite set and S ⊂

                Add to Reading List

                Source URL: iti.mff.cuni.cz

                Language: English - Date: 2016-02-04 05:53:37
                  49The union-closed sets conjecture almost holds for almost all random bipartite graphs Henning Bruhn and Oliver Schaudt Abstract Frankl’s union-closed sets conjecture states that in every finite unionclosed family of set

                  The union-closed sets conjecture almost holds for almost all random bipartite graphs Henning Bruhn and Oliver Schaudt Abstract Frankl’s union-closed sets conjecture states that in every finite unionclosed family of set

                  Add to Reading List

                  Source URL: www.zaik.uni-koeln.de

                  Language: English - Date: 2013-05-11 13:53:39
                  50Kyounghee Kim* (). Pseudo-automorphisms of Blowup of Projective space along a set of points. Preliminary report. Let X be a blowup of Pn along a finite set of points. We will discuss connect

                  Kyounghee Kim* (). Pseudo-automorphisms of Blowup of Projective space along a set of points. Preliminary report. Let X be a blowup of Pn along a finite set of points. We will discuss connect

                  Add to Reading List

                  Source URL: jointmathematicsmeetings.org

                  - Date: 2014-09-14 00:51:43